One-sided Noncommutative Gröbner Bases with Applications to Computing Green's Relations *
نویسنده
چکیده
Standard noncommutative Gröbner basis procedures are used for computing ideals of free noncommutative polynomial rings over fields. This paper describes Gröbner basis procedures for one-sided ideals in finitely presented noncommutative algebras over fields. The polynomials defining a K-algebra A as a quotient of a free K-algebra are combined with the polynomials defining a one-sided ideal I of A, by using a tagging notation. Standard noncommutative Gröbner basis techniques can then be applied to the mixed set of polynomials, thus calculating A/I whilst working in a free structure, avoiding the complication of computing in A. The paper concludes by showing how the results can be applied to completable presentations of semigroups and so enable calculations of Green’s relations.
منابع مشابه
ar X iv : m at h . R A / 9 90 30 33 v 1 5 M ar 1 99 9 One - sided
Standard noncommutative Gröbner basis procedures are used for computing ideals of free noncommutative polynomial rings over fields. This paper describes Gröbner basis procedures for one-sided ideals in finitely presented noncommutative algebras over fields. The polynomials defining a K-algebra A as a quotient of a free K-algebra are combined with the polynomials defining a one-sided ideal I of ...
متن کاملNon-Commutative Gröbner Bases in Poincaré-Birkhoff-Witt Extensions
Commutative Gröbner Bases are a well established technique with many applications, including polynomial solving and constructive approaches to commutative algebra and algebraic geometry. Noncommutative Gröbner Bases are a focus of much recent research activity. For example, combining invariant theory and elimination theory, or elimination in moving frames of partial differential operators invar...
متن کاملNoncommutative involutive bases
Gröbner Basis theory originated in the work of Buchberger [4] and is now considered to be one of the most important and useful areas of computer algebra. In 1993, Zharkov and Blinkov [13] proposed an alternative method of computing a commutative Gröbner Basis, namely the computation of an Involutive Basis. In the mid 1980’s, Mora showed [11] that Buchberger’s work could be generalised for nonco...
متن کاملCanonical Bases for Algebraic Computations
We investigate, for quotients of the non-commutative polynomial ring, a property that implies finiteness of Gröbner bases computation, and examine its connection with Noetherianity. We propose a Gröbner bases theory for our factor algebras, of particular interest for one-sided ideals, and show a few applications, e.g. how to compute (one-sided) syzygy modules.
متن کاملOn Noncommutative Involutive Divisions
Buchberger’s algorithm for computing a Gröbner basis solves the ideal membership problem over commutative polynomial rings. In the early 1990’s, an alternative to this algorithm was found, namely the involutive basis algorithm, which provides a Gröbner basis with extra combinatorial properties. Buchberger’s work was generalised to noncommutative polynomial rings by Bergman and Mora during the 1...
متن کامل